A p, q-analogue of a Formula of Frobenius

نویسندگان

  • Karen S. Briggs
  • Jeffrey B. Remmel
چکیده

Garsia and Remmel (JCT. A 41 (1986), 246-275) used rook configurations to give a combinatorial interpretation to the q-analogue of a formula of Frobenius relating the Stirling numbers of the second kind to the Eulerian polynomials. Later, Remmel and Wachs defined generalized p, q-Stirling numbers of the first and second kind in terms of rook placements. Additionally, they extended their definition to give a p, q-analogue of rook numbers for arbitrary Ferrers boards. In this paper, we use Remmel and Wach’s definition and an extension of Garsia and Remmel’s proof to give a combinatorial interpretation to a p, q-analogue of a formula of Frobenius relating the p, q-Stirling numbers of the second kind to the trivariate distribution of the descent number, major index, and comajor index over Sn. We further define a p, q-analogue of the hit numbers, and show analytically that for Ferrers boards, the p, q-hit numbers are polynomials in (p, q) with nonnegative coefficients.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative algorithm for the generalized ‎$‎(P‎,‎Q)‎$‎-reflexive solution of a‎ ‎quaternion matrix equation with ‎$‎j‎$‎-conjugate of the unknowns

In the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} ‎{underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$‎. ‎By this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎When the‎ ‎matrix equation is consistent over...

متن کامل

On some Frobenius groups with the same prime graph as the almost simple group ${ {bf PGL(2,49)}}$

The prime graph of a finite group $G$ is denoted by $Gamma(G)$ whose vertex set is $pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $Gamma(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by prime graph if there is a finite group $H$ with $Gamma(H)=Gamma(G)$, in while $Hnotcong G$. In this paper, we consider finite groups with the same prime gr...

متن کامل

Inverting the Frobenius Map

The famous Frobenius characteristic map is a bijection from the space of characters of a symmetric group S n to the space of homogeneous symmetric functions of degree n. In this note, we prove a formula for the inverse map. More precisely, we express the generating function for the values of an arbitrary virtual character of S n in terms of the symmetric function which is the Frobenius image of...

متن کامل

q-ANALOGUE OF EULER-BARNES MULTIPLE ZETA FUNCTIONS

Recently (see [1]) I has introduced an interesting the Euler-Barnes multiple zeta function. In this paper we construct the q-analogue of Euler-Barnes multiple zeta function which interpolates the q-analogue of Frobenius-Euler numbers of higher order at negative integers. §

متن کامل

ar X iv : m at h / 01 04 17 8 v 1 [ m at h . N T ] 1 8 A pr 2 00 1 Arithmetic theory of q - difference equations

Part II. p-adic methods §3. Considerations on the differential case §4. Introduction to p-adic q-difference modules 4.1. p-adic estimates of q-binomials 4.2. The Gauss norm and the invariant χv(M) 4.3. q-analogue of the Dwork-Frobenius theorem §5. p-adic criteria for unipotent reduction 5.1. q-difference modules having unipotent reduction modulo ̟v 5.2. q-difference modules having unipotent redu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2003